1 Placement

نویسنده

  • Chris Chu
چکیده

Placement is the process of determining the locations of circuit devices on a die surface. It is an important stage in the VLSI design flow, because it affects routability, performance, heat distribution, and to a less extent, power consumption of a design. Traditionally, it is applied after the logic synthesis stage and before the routing stage. Since the advent of deep submicron process technology around the mid-1990s, interconnect delay, which is largely determined by placement, has become the dominating component of circuit delay. As a result, placement information is essential, even in early design stages, to achieve better circuit performance. In recent years, placement techniques have been integrated into the logic synthesis stage to perform physical synthesis and into the architecture design stage to perform physical-aware architecture design. This chapter begins with an introduction to the placement stage. Next, various placement problem formulations are discussed. Then, partitioning-based approach, simulated annealing approach, and analytical approach for global placement are presented. After that, legalization and detail placement algorithms are described. The chapter concludes with a discussion of other placement approaches and useful resources to placement research.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Based Optimization Using Tap Setting Transformer, DG and Capacitor Placement in Distribution Networks

In this article, a multi-objective function for placement of Distributed Generation (DG) and capacitors with thetap setting of Under Load Tap Changer (ULTC) Transformer is introduced. Most of the recent articles have paidless attention to DG, capacitor placement and ULTC effects in the distribution network simultaneously. Insimulations, a comparison between different modes was carried out with,...

متن کامل

Presenting a New Method Based on Branch Placement for Optimal Placement of Phasor Measurement Units

In this paper, a new method based on branch placement for the optimal positioning of Phasor Measurement Units (PMUs) in power systems is proposed. In this method, the PMUs are in type of single-channel and are installed at the beginning of the branches. Therefore, they are able to measure the bus voltages. Also, the installation of the PMUs on the branches increases the security of observabilit...

متن کامل

The Mediating Role of Placement in Service Quality of Education: From International Students’ Perspective

The drive of this investigation is to diagnose the mediation effect of placement between program quality, industrial link, student satisfaction, and service quality in the circumstance of tertiary education in Malaysia. Using the Cue Utilization theory, the proposed model is tested employing data collected from 173 international students who are pursuing study at University Utara Malaysia throu...

متن کامل

Pole placement algorithm for control of civil structures subjected to earthquake excitation

In this paper the control algorithm for controlled civil structures subjected to earthquake excitation is thoroughly investigated. The objective of this work is the control of structures by means of the pole placement algorithm, in order to improve their response against earthquake actions. Successful application of the algorithm requires judicious placement of the closed-loop eigenvalues from ...

متن کامل

VISCOUS DAMPER PLACEMENT OPTIMIZATION IN CONCRETE STRUCTURES USING COLLIDING BODIES ALGORITHM AND STORY DAMAGE INDEX

Dampers can reduce structural response under dynamic loads. Since dampers are costly, the design of structures equipped with dampers should make their application economically justifiable. Among the effective cost reduction factors is optimal damper placement. Hence, this study intended to find the optimal viscous damper placement using efficient optimization methods. Taking into account the no...

متن کامل

4-PLACEMENT OF ROOTED TREES

A tree T of order n is called k-placement if there are k edge-disjoint copies of T into K_{n}. In this paper we prove some results about 4-placement of rooted trees.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008